The Fleet Size and Mix Pollution- Routing Problem

نویسندگان

  • Çağri Koç
  • Tolga Bektaş
  • Ola Jabali
  • Gilbert Laporte
چکیده

This paper introduces the fleet size and mix pollution-routing problem which extends the pollution-routing problem by considering a heterogeneous vehicle fleet. The main objective is to minimize the sum of vehicle fixed costs and routing cost, where the latter can be defined with respect to the cost of fuel and CO2 emissions, and driver cost. Solving this problem poses several methodological challenges. To this end, we have developed a powerful metaheuristic which was successfully applied to a large pool of realistic benchmark instances. Several analyses have been conducted to shed light on the trade-offs between various performance indicators, including capacity utilization, fuel and emissions and costs pertaining to vehicle acquisition, fuel consumption and drivers. The analyses also quantify the benefits of using a heterogeneous fleet over a homogeneous one.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem

In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...

متن کامل

An Integrated Approach for Facility Location and Supply Vessel Planning with Time Windows

This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...

متن کامل

A New School Bus Routing Problem Considering Gender Separation, Special Students and Mix Loading: A Genetic Algorithm Approach

In developing countries, whereas the urban bus network is a major part of public transportation system, it is necessary to try to find the best design and routing for bus network. Optimum design of school bus routes is very important. Non-optimal solutions for this problem may increase traveling time, fuel consumption, and depreciation rate of the fleet. A new bus routing problem is presented i...

متن کامل

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

T fleet size and mix vehicle routing problem with time windows (FSMVRPTW) is the problem of determining, at the same time, the composition and the routing of a fleet of heterogeneous vehicles aimed to serve a given set of customers. The routing problem requires us to design a set of minimum-cost routes originating and terminating at a central depot and serving customers with known demands, with...

متن کامل

A sweep-based algorithm for the fleet size and mix vehicle routing problem

This paper presents a new sweep based heuristic for the fleet size and mix vehicle routing problem. This problem involves two kinds of decisions: the selection of a mix of vehicles among the available vehicle types and the routing of the selected fleet. The proposed algorithm first generates a large number of routes that are serviced by one or two vehicles. The selection of routes and vehicles ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014